1884A - Simple Design - CodeForces Solution


brute force constructive algorithms greedy greedy greedy greedy greedy greedy greedy greedy math

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long ll;
ll sum(ll n)
{
	ll res = 0;
	while (n != 0)
	{
		res += (n % 10);
		n /= 10;
	}
	return res;
}
int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	int t;
	cin >> t;
	while (t--)
	{
		ll n, k;
		cin >> n >> k;
		for (ll i = n;; i++)
		{
			if (sum(i) % k == 0)
			{
				cout << i << "\n";
				break;
			}
		}
	}

	return 0;
}


Comments

Submit
0 Comments
More Questions

701. Insert into a Binary Search Tree
429. N-ary Tree Level Order Traversal
739. Daily Temperatures
647. Palindromic Substrings
583. Delete Operation for Two Strings
518. Coin Change 2
516. Longest Palindromic Subsequence
468. Validate IP Address
450. Delete Node in a BST
445. Add Two Numbers II
442. Find All Duplicates in an Array
437. Path Sum III
436. Find Right Interval
435. Non-overlapping Intervals
406. Queue Reconstruction by Height
380. Insert Delete GetRandom O(1)
332. Reconstruct Itinerary
368. Largest Divisible Subset
377. Combination Sum IV
322. Coin Change
307. Range Sum Query - Mutable
287. Find the Duplicate Number
279. Perfect Squares
275. H-Index II
274. H-Index
260. Single Number III
240. Search a 2D Matrix II
238. Product of Array Except Self
229. Majority Element II
222. Count Complete Tree Nodes